Additive Complements for a Given Asymptotic Density
نویسندگان
چکیده
We investigate the existence of subsets A and B $${\mathbb {N}}:=\{0,1,2,\dots \}$$ , such that sumset $$A+B:=\{a+b:a\in A,b\in B\}$$ has prescribed asymptotic density. solve particular case in which is a given finite subset {N}}$$ also when $$B=A$$ ; later case, we generalize our result to $$kA:=\{x_1+\cdots +x_k: x_i\in A, i=1,\dots ,k\}$$ for an integer $$k\ge 2.$$
منابع مشابه
Asymptotic Density for Equivalence
In this paper we study the asymptotic behavior of the fraction of true formulas against all formulas over k propositional variables with equivalence as the only connective in the language. We consider two ways of measuring the asymptotic behavior. In the first case we investigate the size of the tautology fraction of length n against the number of all formulas of length n. The second case is ve...
متن کاملSparse sets in the complements of graphs with given girth
A set of edges in a graph is sparse if no two of these edges belong to the same clique. It is shown here that if a graph has girth at least 5, 6 or 8 then the largest number of edges in a sparse set in its complement is at most 8, 7 or 6, respectively; this result is complete and best possible. It follows that if ¿ 0, then for su1ciently large n there exists a graph with n vertices and chromati...
متن کاملAsymptotic normality of the posterior given a statistic
The authors establish the asymptotic normality and determine the limiting variance of the posterior density for a multivariate parameter, given the value of a consistent and asymptotically Gaussian statistic satisfying a uniform local central limit theorem. Their proof is given in the continuous case but generalizes to lattice-valued random variables. It hinges on a uniform Edgeworth expansion ...
متن کاملAsymptotic Enumeration of Tournaments with a Given Score Sequence
A tournament is a digraph in which, for each pair of distinct vertices v and w, either (v,w) or (w, v) is an edge, but not both. A tournament is regular if the in-degree is equal to the out-degree at each vertex. Let v1, v2, . . . , vn be the vertices of a labelled tournament and let d−j , d + j be the in-degree and out-degree of vj for 1 ≤ j ≤ n. d+j is also called the score of vj . Define δj ...
متن کاملAn asymptotic formula in additive number theory
1 . Introduction . In his paper [1], Erdös introduced the sequences of positive integers b 1 < b, < . . ., with (b ;, bj ) = 1, for i ~A j, and 'bi 1 < oo . With any such arbitrary sequence of integers, he associated the sequence {di} of all positive integers not divisible by any bj , and he showed that if b1 > 2, there exists a 0 < 1 (independent of the sequence {b i }) such that d i 1 di < d°...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mediterranean Journal of Mathematics
سال: 2021
ISSN: ['1660-5454', '1660-5446']
DOI: https://doi.org/10.1007/s00009-020-01679-0